Geodesic Discrete Global Grid Systems

نویسندگان

  • Kevin Sahr
  • Denis White
  • Jon Kimerling
چکیده

In recent years, a number of data structures for global geo-referenced data sets have been proposed based on regular, multi-resolution partitions of polyhedra. We present a survey of the most promising of such systems, which we call Geodesic Discrete Global Grid Systems (Geodesic DGGSs). We show that Geodesic DGGS alternatives can be constructed by specifying five substantially independent design choices: a base regular polyhedron, a fixed orientation of the base regular polyhedron relative to the Earth, a hierarchical spatial partitioning method defined symmetrically on a face (or set of faces) of the base regular polyhedron, a method for transforming that planar partition to the corresponding spherical/ellipsoidal surface, and a method for assigning point representations to grid cells. The majority of systems surveyed are based on the icosahedron, use an aperture 4 triangle or hexagon partition, and are either created directly on the surface of the sphere or by using an equalarea transformation. An examination of the design choice options leads us to the construction of the Icosahedral Snyder Equal Area aperture 3 Hexagon (ISEA3H) Geodesic DGGS.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete Global Grid Systems*

A new class of spatial data structures called discrete global grid systems (DGGS’s) is introduced and the general application classes for it are discussed. DGGS’s based on subdivisions of the platonic solids, called Geodesic DGGS’s, are then introduced. A number of existing and proposed Geodesic DGGS’s are examined by looking at four design choices that must be made in constructing a Geodesic D...

متن کامل

Numerical Treatment of Geodesic Differential Equations on Two Dimensional Surfaces

This paper presents a brief instructions to nd geodesics equa-tions on two dimensional surfaces in R3. The resulting geodesic equations are solved numerically using Computer Program Matlab, the geodesics are dis-played through Figures.

متن کامل

Global advection transport model on hexagonal-pentagonal geodesic grid by multi-moment scheme

A 3rd order numerical model is developed for global advection transport computation. The multi-moment finite volume method has been implemented to the hexagonal-pentagonal geodesic grid for spherical geometry. Two kinds of moments, i.e. point value and volume-integrated average, are used as the constraint conditions to derive the time evolution equations to update the computational variables, w...

متن کامل

Analysis of grid imprinting on geodesic spherical icosahedral grids

Numerical grid imprinting errors have often been observed in global atmospheric models on icosahedral grids. In this paper we analyse the sources of grid imprinting error related to the usual finite volume discretization of the divergence operator. We introduce the concept of alignment of computational cells, and establish that convergence of second order is attained on aligned cells. Moreover,...

متن کامل

Closure Spaces in the Plane

When closure operators are deened over gures in the plane, they are normally deened with respect to convex closure in the Euclidean plane. This report concentrates on discrete closure operators deened over the discrete, rectilinear plane. Basic to geometric convexity is the concept of a geodesic, or shortest path. Such geodesics can be regarded as the closure of two points. But, given the usual...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003